Many search algorithms can be regarded as traversing a graph of possible states. This includes game playing where the states are board positions and the connections moves between them, but also more general planning such as means-end analysis. Some models cognitive models including ACT-R and SOAR use forms of state space search to emulate human planning and problem solving.
Used in Chap. 3: page 32; Chap. 15: page 240; Chap. 22: page 368
Also known as state space traversal
Towers of Hanoi: graph of possible states and moves.